On the Finiteness Property for Rational Matrices Raphaël Jungers and Vincent D. Blondel

نویسنده

  • VINCENT D. BLONDEL
چکیده

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This conjecture, known as the “finiteness conjecture”, is now known to be false but no explicit counterexample to the conjecture is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do. We also show that all pairs of 2× 2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for sets of nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Finiteness Property for Rational Matrices

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This conjecture, known as the “finiteness conjecture”, is...

متن کامل

Finiteness property of pairs of 2×2 sign-matrices via real extremal polytope norms

This paper deals with the joint spectral radius of a finite set of matrices. We say that a set of matrices has the finiteness property if the maximal rate of growth, in the multiplicative semigroup it generates, is given by the powers of a finite product. Here we address the problem of establishing the finiteness property of pairs of 2× 2 sign-matrices. Such problem is related to the conjecture...

متن کامل

Efficient algorithms for deciding the type of growth of products of integer matrices

For a given finite set Σ of matrices with nonnegative integer entries we study the growth of max t (Σ) = max{‖A1 . . . At‖ : Ai ∈ Σ}. We show how to determine in polynomial time whether the growth with t is bounded, polynomial, or exponential, and we characterize precisely all

متن کامل

An explicit counterexample to the Lagarias-Wang finiteness conjecture

The joint spectral radius of a finite set of real d × d matrices is defined to be the maximum possible exponential rate of growth of long products of matrices drawn from that set. A set of matrices is said to have the finiteness property if there exists a periodic product which achieves this maximal rate of growth. J. C. Lagarias and Y. Wang conjectured in 1995 that every finite set of real d× ...

متن کامل

The boundedness of all products of a pair of matrices is undecidable

We show that the boundedness of the set of all products of a given pair Σ of rational matrices is undecidable. Furthermore, we show that the joint (or generalized) spectral radius ρ(Σ) is not computable because testing whether ρ(Σ) ≤ 1 is an undecidable problem. As a consequence, the robust stability of linear systems under time-varying perturbations is undecidable, and the same is true for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007